Pascal-Francis CNRS

Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("HAMILTONIAN PATH")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 202

  • Page / 9
Export

Selection :

  • and

ON K-PATH HAMILTONIEN MAXIMAL PLANAR GRAPHSBAYBARS I.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 40; NO 1; PP. 119-121; BIBL. 8 REF.Article

THE EFFECT OF NUMBER OF HAMILTONIAN PATHS ON THE COMPLEXITY OF A VERTEX-CALORING PROBLEMMANBER U; TOMPA M.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 220-227; BIBL. 5 REF.Conference Paper

ON THE ENUMERATION OF HAMILTONIAN ROADS AND CIRCUITS IN CERTAIN PARTIAL GRAPHS OF KNCIOBOTARU S.1978; REC. ROUMAINE MATH. PURES APPL.; ROM; DA. 1978; VOL. 23; NO 10; PP. 1487-1496; BIBL. 6 REF.Article

HAMILTON PATHS IN GRID GRAPHSITAI A; PAPADIMITRIOU CH; SZWARCFITER JL et al.1982; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 4; PP. 676-686; BIBL. 10 REF.Article

MODELE DE SERVICE D'OBJETS ELOIGNESRUBAL'SKIJ GB.1980; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1980; NO 1; PP. 86-92; BIBL. 3 REF.Article

HEURISTIC FOR THE HAMILTONIAN PATH PROBLEM IN EUCLIDIAN TWO SPACENORBACK JP; LOVE RF.1979; J. OPERAT. RES. SOC.; GBR; DA. 1979; VOL. 30; NO 4; PP. 363-368; BIBL. 8 REF.Article

NEGATIVE RESULTS ON COUNTINGVALIANT LG.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 38-46; BIBL. 32 REF.Conference Paper

On mutually independent hamiltonian pathsTENG, Yuan-Hsiang; TAN, Jimmy J. M; HO, Tung-Yang et al.Applied mathematics letters. 2006, Vol 19, Num 4, pp 345-350, issn 0893-9659, 6 p.Article

3/2-approximation algorithm for two variants of a 2-depot Hamiltonian path problemRATHINAM, Sivakumar; SENGUPTA, Raja.Operations research letters. 2010, Vol 38, Num 1, pp 63-68, issn 0167-6377, 6 p.Article

Spanning multi-paths in hypercubesCAHA, Rostislav; KOUBEK, Vaclav.Discrete mathematics. 2007, Vol 307, Num 16, pp 2053-2066, issn 0012-365X, 14 p.Article

The hamiltonicity of bipartite graphs involving neighborhood unionsGUANTAO CHEN; SAITO, Akira; BING WEI et al.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 45-56, issn 0012-365XConference Paper

On minimum degree in hamiltonian path graphsHENDRY, G. R. T.Journal of graph theory. 1988, Vol 12, Num 4, pp 491-497, issn 0364-9024Article

Infinite Hamiltonian paths in Cayley digraphsJUNGREIS, I. L.Discrete mathematics. 1985, Vol 54, Num 2, pp 167-180, issn 0012-365XArticle

A linear-time algorithm for the longest path problem in rectangular grid graphsKESHAVARZ-KOHJERDI, Fatemeh; BAGHERI, Alireza; ASGHARIAN-SARDROUD, Asghar et al.Discrete applied mathematics. 2012, Vol 160, Num 3, pp 210-217, issn 0166-218X, 8 p.Article

On the Bandpass problemGUOHUI LIN.Journal of combinatorial optimization. 2011, Vol 22, Num 1, pp 71-77, issn 1382-6905, 7 p.Article

PARTITIONS OF FAULTY HYPERCUBES INTO PATHS WITH PRESCRIBED ENDVERTICESDVORAK, Tomáš; GREGOR, Petr.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 4, pp 1448-1461, issn 0895-4801, 14 p.Article

On Hamiltonian cycles and Hamiltonian pathsSOHEL RAHMAN, M; KAYKOBAD, M.Information processing letters. 2005, Vol 94, Num 1, pp 37-41, issn 0020-0190, 5 p.Article

Minimal change list for Lucas strings and some graph theoretic consequencesBARIL, Jean-Luc; VAJNOVSZKI, Vincent.Theoretical computer science. 2005, Vol 346, Num 2-3, pp 189-199, issn 0304-3975, 11 p.Article

On backbone coloring of graphsWEIFAN WANG; YUEHUA BU; MONTASSIER, Mickaël et al.Journal of combinatorial optimization. 2012, Vol 23, Num 1, pp 79-93, issn 1382-6905, 15 p.Article

Noncrossing Hamiltonian paths in geometric graphsCERNY, Jakub; DVORAK, Zdenek; JELINEK, Vit et al.Discrete applied mathematics. 2007, Vol 155, Num 9, pp 1096-1105, issn 0166-218X, 10 p.Conference Paper

An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphsHSIEH, Sun-Yuan.Journal of parallel and distributed computing (Print). 2004, Vol 64, Num 5, pp 662-685, issn 0743-7315, 24 p.Article

Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphsBULLOCK, Frank; FRICK, Marietjie; SINGLETON, Joy et al.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1266-1275, issn 0012-365X, 10 p.Conference Paper

α-Extendable paths in infinite graphsPOLAT, Norbert.Discrete mathematics. 2005, Vol 291, Num 1-3, pp 175-189, issn 0012-365X, 15 p.Article

Hamiltonian paths with prescribed edges in hypercubesDVORAK, Tomas; GREGOR, Petr.Discrete mathematics. 2007, Vol 307, Num 16, pp 1982-1998, issn 0012-365X, 17 p.Article

Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)MONNOT, Jérome.European journal of operational research. 2005, Vol 161, Num 3, pp 721-735, issn 0377-2217, 15 p.Article

  • Page / 9